Equivalence of Markov processes
نویسندگان
چکیده
منابع مشابه
Approximate Equivalence of Markov Decision Processes
We consider the problem of finding the minimal ǫ-equivalent MDP for an MDP given in its tabular form. We show that the problem is NP-Hard and then give a bicriteria approximation algorithm to the problem. We suggest that the right measure for finding minimal ǫ-equivalent model is L1 rather than L∞ by giving both an example, which demonstrates the drawback of using L∞, and performance guarantees...
متن کاملStochastic Equivalence of Cpdp-automata and Piecewise Deterministic Markov Processes
CPDP is a class of automata designed for compositional specification/analysis of certain stochastic hybrid processes. We prove equivalence of the stochastic behaviors of CPDPs (newly defined here) and PDPs. With this result we obtain a clear stochastic processes semantics for CPDPs and we obtain the opportunity to use the powerful PDP analysis techniques in the context of the compositional fram...
متن کاملEquivalence Relations in Fully and Partially Observable Markov Decision Processes
We explore equivalence relations between states in Markov Decision Processes and Partially Observable Markov Decision Processes. We focus on two different equivalence notions: bisimulation [Givan et al., 2003] and a notion of trace equivalence, under which states are considered equivalent if they generate the same conditional probability distributions over observation sequences (where the condi...
متن کاملEquivalence notions and model minimization in Markov decision processes
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for solving them run in time polynomial in the size of the state space, where this size is extremely large for most real-world planning problems of interest. Recent AI research has addressed this problem by representing the ...
متن کاملON THE INFINITE ORDER MARKOV PROCESSES
The notion of infinite order Markov process is introduced and the Markov property of the flow of information is established.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1968
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-1968-0230375-4